Description: 图论算法及其MATLAB 程序代码
1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法
2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法
3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法
6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6. Platform: |
Size: 47104 |
Author:肖翔 |
Hits:
Description: 关于图论的一些算法和应用。 网络流、上下界网络流、km最佳匹配，弦图判定，一般图最大匹配，有向图最小生成树。-Some on the graph theory algorithms and applications. Network flows, network flow bounds, km best match the string diagram as to the general graph maximum matching, minimum spanning tree directed graph. Platform: |
Size: 8192 |
Author:Mr.Only |
Hits:
Description: 中文分词-前向最大匹配方法；VS2008环境下实现-Chinese word- the former to the maximum matching method VS2008 environment to achieve Platform: |
Size: 937984 |
Author:孙伟 |
Hits:
Description: 直接运行compile.bat和run.bat即可
使用了3种分词方法：
1.正向最大匹配(ForwardMatch.java)
2.逆向最大匹配(ForwardMatch.java)
3.最大频率匹配(FrequencyMatch.java)(默认)
取频率最高的词，然后两端递归，构建二杈树存储句子中的词语，显示的时候使用中序遍历二杈树
由于极有可能单个字的使用频率比整个词还高，筛选的时候进行了处理
若单个字不处于当前句子开头，先忽略，
若单个的字处在开头，临时mostFrequency仍为0，且单词长度为1，则加入到二杈树中-Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree Platform: |
Size: 1253376 |
Author:吴浩 |
Hits:
Description: 是设计并实现一个汉语自动分词系统。在分析了自动分词面临的主要困难和难点的基础上，旨在降低分词难度和提高分词精度，设计并实现了一个基于正向最大匹配的汉语自动分词系统。-The design and implementation of a Chinese word segmentation system. In the analysis of word segmentation and difficulty of the major difficulties facing based on the word to reduce the difficulty and improve the segmentation accuracy, design and implementation of a maximum matching based on positive Chinese word segmentation system. Platform: |
Size: 1024 |
Author:杨亮 |
Hits:
Description: 基于rmm算法（逆向最大匹配）实现的中文分词系统，具体内容是一个mfc工程文件。-Rmm-based algorithm (reverse maximum matching) to achieve the Chinese word segmentation system, specific content is a mfc project file. Platform: |
Size: 13403136 |
Author:乐文 |
Hits:
Description: （个人原创）《中文网页自动分类》
牵扯的技术有：分词，统计词频，踢出网页中一些特殊字符（用正则表达式），还有需要提取培训集等等！！
此软件禁止商业活动，版权所属“qyTT论坛--www.qyclass.org/bbs”
本文来自: qyTT论坛 http://www.qyclass.org/bbs 我们的使命：让世界认识qyTT，让qyTT认识世界!
结果分析的思想：就是把得到的词频与建立的词库里每一类进行比较，如果存在一个最大匹配程度，就去这个类作为结果，如果存在多个最大值，那么就去词库里特征词最少的一个！！
-(Individual original) " Chinese Web Page Automatic Classification" involves technology are: Word, word frequency statistics, kicked out the page number of special characters (using regular expressions), and need to extract the training set and more! ! Results of the idea: is to get the word frequency and the establishment of the vocabulary in each category of comparison, if there is a maximum matching degree, and went to the class as a result, if there is more than the maximum, then go inside thesaurus features at least one word! ! Platform: |
Size: 1490944 |
Author:guowei |
Hits:
Description: 用正向最大匹配算法解析中文网页的小程序~-Analysis of the maximum matching algorithm with forward small program ~ Chinese website Platform: |
Size: 611328 |
Author:张伟哲 |
Hits:
Description: 分别用最大匹配和最大熵的方法实现了汉语分词-Respectively maximum matching and maximum entropy methods to achieve the Chinese word Platform: |
Size: 2203648 |
Author:yum056 |
Hits:
Description: 中文分词在中文信息处理中是最最基础的，无论机器翻译亦或信息检索还是其他相关应用，如果涉及中文，都离不开中文分词，因此中文分词具有极高的地位。中文分词入门最简单应该是最大匹配法了-Chinese word segmentation in Chinese information processing is the most basic, whether in machine translation Yihuo information retrieval, or other related applications, if it involves the Chinese, are inseparable from the Chinese word, the Chinese word has a very high position. Introduction to Chinese word should be the easiest of the maximum matching Platform: |
Size: 60416 |
Author:随风 |
Hits:
Description: 实现了中文分词和词性标注程序。分词方法采用“三词正向最长匹配”。词性标注使用HMM方法，用Viterbi算法实现。“三词正向最长匹配”保持了“正向最长匹配算法”快速的特点，同时提高了分词的准确性。-Chinese word segmentation and implemented procedures for POS tagging. Segmentation Methods, " the longest three-match positive words." POS tagging using HMM method, the Viterbi algorithm. " Three words maximum positive match" to maintain a " positive maximum matching algorithm," Fast features, while improving the accuracy of segmentation. Platform: |
Size: 4034560 |
Author:paul |
Hits:
Description: 中文分词在中文信息处理中是最最基础的，无论机器翻译亦或信息检索还是其他相关应用，如果涉及中文，都离不开中文分词，因此中文分词具有极高的地位。中文分词入门最简单应该是最大匹配法-Chinese word segmentation in Chinese information processing is the most basic, whether in machine translation Yihuo information retrieval, or other related applications, if it involves the Chinese, are inseparable from the Chinese word, the Chinese word has a very high position. Introduction to Chinese word should be the maximum matching the most simple method Platform: |
Size: 2048 |
Author:zht |
Hits:
Description: VC6.0实现的中文自动分词，包括最大正向匹配和最大逆向匹配切分，可运行-VC6.0 achieve automatic Chinese word segmentation, including the largest positive match and the maximum matching segmentation reverse, can run Platform: |
Size: 2244608 |
Author:任丽芸 |
Hits:
Description: 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow Platform: |
Size: 7168 |
Author:陈帅军 |
Hits:
Description: 关于二分图中一些定义，定理及如何求解最大流的问题-Bipartite graph on some definitions, theorems and how to solve the problem of maximum flow Platform: |
Size: 21504 |
Author:陈帅军 |
Hits:
Search - maximum matching